Constructing protein polyhedra via orthogonal chemical interactions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Ordered Orthogonal Arrays via Sudoku

For prime powers q we use “strongly orthogonal” linear sudoku solutions of order q to construct ordered orthogonal arrays of type OOA(4, s, 2, q), and for each q we present a range of values of s for which these constructions are valid. These results rely strongly on flags of subspaces in a four dimensional vector space over a finite field.

متن کامل

Epsilon-Unfolding Orthogonal Polyhedra

An unfolding of a polyhedron is produced by cutting the surface and flattening to a single, connected, planar piece without overlap (except possibly at boundary points). It is a long unsolved problem to determine whether every polyhedron may be unfolded. Here we prove, via an algorithm, that every orthogonal polyhedron (one whose faces meet at right angles) of genus zero may be unfolded. Our cu...

متن کامل

Reconstruction of Orthogonal Polyhedra

In this thesis I study reconstruction of orthogonal polyhedral surfaces and orthogonal polyhedra from partial information about their boundaries. There are three main questions for which I provide novel results. The first question is “Given the dual graph, facial angles and edge lengths of an orthogonal polyhedral surface or polyhedron, is it possible to reconstruct the dihedral angles?” The se...

متن کامل

Unfolding Orthogonal Polyhedra

Recent progress is described on the unsolved problem of unfolding the surface of an orthogonal polyhedron to a single non-overlapping planar piece by cutting edges of the polyhedron. Although this is in general not possible, partitioning the faces into the natural vertex-grid may render it always achievable. Advances that have been made on various weakenings of this central problem are summariz...

متن کامل

Edge-guarding Orthogonal Polyhedra

We address the question: How many edge guards are needed to guard an orthogonal polyhedron of e edges, r of which are reflex? It was previously established [3] that e/12 are sometimes necessary and e/6 always suffice. In contrast to the closed edge guards used for these bounds, we introduce a new model, open edge guards (excluding the endpoints of the edge), which we argue are in some sense mor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 2020

ISSN: 0028-0836,1476-4687

DOI: 10.1038/s41586-019-1928-2